منابع مشابه
Interval Integration Revisited
We present an overview of approaches to selfvalidating one-dimensional integration quadrature formulas and a verified numerical integration algorithm with an adaptive strategy. The new interval integration adaptive algorithm delivers a desired integral enclosure with an error bounded by a specified error bound. The adaptive technique is usually much more efficient than Simpson’s rule and narrow...
متن کاملInterval Methods Revisited
This paper presents a branch & cut algorithm to nd all isolated solutions of a system of polynomial constraints. Our ndings show that fairly straightforward reenements of interval methods inspired by AI constraint propagation techniques result in a multivariate root nding algorithm that is competitive with continuation methods on most benchmarks and which can solve a variety of systems that are...
متن کاملPolynomial Precise Interval Analysis Revisited
We consider a class of arithmetic equations over the complete lattice of integers (extended with−∞ and∞) and provide a polynomial time algorithm for computing least solutions. For systems of equations with addition and least upper bounds, this algorithm is a smooth generalization of the Bellman-Ford algorithm for computing the single source shortest path in presence of positive and negative edg...
متن کاملEigenvalues of symmetric tridiagonal interval matrices revisited
In this short note, we present a novel method for computing exact lower and upper bounds of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and avoids any assumptions Our construction explicitly yields those matrices for which particular lower and upper bounds are attained.
متن کاملTotal Domination in Interval Graphs Revisited
A set of vertices D is a dominating set of a graph G = (V, E) if every vertex in VD is adjacent to a vertex in D. A set of vertices D is a total-dominating set of a graph G = (V, E) if every vertex in V is adjacent to a vertex in D. The problems of finding a minimum cardinality dominating set or a minimum cardinality totaldominating set are both NP-complete for many classes of graphs [6,2], tho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Journal of Applied Sciences
سال: 2012
ISSN: 2165-3917,2165-3925
DOI: 10.4236/ojapps.2012.24b026